On Harmonious Labelings of Some Cycle Related Graphs
نویسندگان
چکیده
A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G)→ {0, 1, 2, · · · , 2q − 1} such that the induced function f∗ : E(G) → {1, 3, · · · , 2q − 1} defined by f∗(uv) = f(u) + f(v) is a bijection. A graph that admits odd harmonious labeling is called odd harmonious graph. In this paper we prove that any two even cycles sharing a common vertex and a common edge are odd harmonious graphs.
منابع مشابه
A magical approach to some labeling conjectures
In this paper, a complete characterization of the (super) edge-magic linear forests with two components is provided. In the process of establishing this characterization, the super edge-magic, harmonious, sequential and felicitous properties of certain 2-regular graphs are investigated , and several results on super edge-magic and felicitous labelings of unions of cycles and paths are presented...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کامل(Di)graph products, labelings and related results
Gallian’s survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative results that provide lower bounds on the number of nonisomorphic labelings of a particular type. In this talk, we will focus in three of the (di)graphs p...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملEnumerating Families of Labeled Graphs
In 1966, Rosa introduced, among others, αand β-labelings as tools to solve the isomorphic decomposition problem of the complete graph. Ten years later, Sheppard calculated the number of αand β-labeled graphs with n edges. In this paper we use an extended version of the adjacency matrix of a graph to determine the number of gracefully labeled graphs with n edges; furthermore, we also calculate t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 65 شماره
صفحات -
تاریخ انتشار 2002